A study of performance of the KLSE Syariah Index

This study compares the performance of the Syariah Index (SI) and the Composite Index (CI) of the Kuala Lumpur Stock Exchange (KLSE) during the period April 1999 to January 2002. Both the raw and risk-adjusted returns were calculated for the indices for the whole and two subperiods. Results based on the raw returns revealed that generally, the KLSE SI and CI recorded the same level of returns. Tests using performance measures of Adjusted Sharpe Index, Treynor Index and Adjusted Jensen Alpha revealed that there were also no significant difference in the (risk-adjusted) performance of both indices. We therefore conclude that Syariah-approved stocks were not more favourable than the other stocks in the KLSE

The division free parallel algorithm for finding determinant

A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated

Compatible factorizations and three-fold triple systems

A three-fold triple system is a design wherein each pair of treatments occurs exactly once. One way to construct this design is by using an idempotent commutative quasigroup. This paper attempts to provide another method of constructing a 3-fold triple system. Firstly, we would like to discuss compatible factorization without multiple edges using a patterned starter construction.Then, we will use this construction to enumerate a distinct 3-fold triple system for every odd order v > 3

On the weakness of linear programming to interpret the nature of solution of fully fuzzy linear system

One of the applications of linear programing is to get solutions for fully fuzzy linear system (FFLS) when the near-zero fuzzy number is considered.This usage could be applied to interpret the nature of FFLS solution according to the nature of FFLS solution in the work of Babbar et al.(Soft Comput. 17:1-12, 2012) and Kumar et al. (Advances in Fuzzy Systems 2011:1-8, 2011).This paper shows that the nature of FFLS solutions must not depend upon the nature of linear programming (LP) solutions, because LP is not enough to obtain all the exact solutions for FFLS which contradicts the claims of researchers.Counter examples are provided in order to falsify those claims.Numerically, we confirm that the nature of the possible way of solving FFLS is completely different from that of the linear system. For instance, FFLS may have two unique solutions which contradict the uniqueness that can be obtained through only one unique solution

SEALiP: A simple and efficient algorithm for listing permutation via starter set method

Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time

Algebraic properties of generalized Fibonacci Sequence via matrix Methods

Over the past centuries, the fascination over the Fibonacci sequences and their generalizations has been shown by mathematicians and the wider scientific community. While most of the known algebraic properties of these sequences were found based on the well-known Binet formula, new discoveries seemed to have been dwarfed by the nature of the complexity of its methodology. Recently, matrix method has become a popular tool among many researchers working on Fibonacci related sequences. In this study, we investigate the generalized Fibonacci sequence by employing two different matrix methods, namely, the method of diagonalization and the method of matrix collation, making use of several generating matrices. We obtained some new algebraic properties and the sum of the generalized fibonacci sequence with different indice

Designing and conducting cost-effectiveness analysis studies in healthcare

Background: Health economic evaluation is essentials in the era of growing development of new health interventions to improve health of people and healthcare system. It focuses on the comparative analysis of alternative options in terms of both costs and consequences. Economic evaluation using cost-effectiveness analysis (CEA) technique helps the analyst to identify the most cost-effective option for achieving a pre-set objective. It is a method of assessing whether the current mix of interventions is efficient as well as whether a proposed new technology or intervention is appropriate. This article aims to describe the essentials steps in designing and conducting health economic evaluation studies in healthcare settings using CEA technique. Materials and methods: The content was based on reviewed of various articles searched through both online databases such as google scholar, MEDLINE, PUBMED and CINAHL and manual publication on information pertaining to health economics and CEA. Results and discussion: There are 4 preliminary considerations and 5 essential steps in conducting CEA. The preliminary consideration includes baseline determination, selecting appropriate outcome, determining the cost perspective and time horizon. The baseline can be no program or existing program or other drugs or surgical procedures for specific treatment of specific diseases. The outcomes need to be the same for all the comparable interventions and can be either single or combined outcomes. Deciding cost perspective either societal or provider perspectives is for the basis of the analysis, which cost will be attributed to the outcomes. Time frame is the amount of time which the analysis is projected while analytic horizon refers to length of time which both costs and outcomes are collected. The first and second steps in conducting CEA are developing research questions that must be clearly defined and designing decision analysis tree to graphically describe the sequence in which intervention occur, how the course of a health condition is affected, complications, and health outcomes may follow. The third steps are measuring both cost and outcome. The fourth steps are calculating cost effectiveness ratio (CER) and incremental cost effectiveness ratio (ICER) and the final steps is testing for uncertainty by conducting sensitivity analysis to test the robustness of the conclusions of an economic evaluation. Conclusion: Good justification of a program/intervention in terms of costs and its effectiveness must be ascertained prior to implementation, therefore health economic evaluation studies using CEA may facilitate in the decision-making process for efficient resource allocation

New recursive circular algorithm for listing all permutations

Linear array of permutations is hard to be factorised. However, by using a starter set, the process of listing the permutations becomes easy. Once the starter sets are obtained, the circular and reverse of circular operations are easily employed to produce distinct permutations from each starter set. However, a problem arises when the equivalence starter sets generate similar permutations and, therefore, willneed to be discarded. In this paper, a new recursive strategy is proposed to generate starter sets that will not incur equivalence by circular operation. Computational advantages are presented that compare the results obtained by the new algorithm with those obtained using two other existing methods. The result indicates that the new algorithm is faster than the other two in time execution

A note on “The nearest symmetric fuzzy solution for a symmetric fuzzy linear system”

This paper provides accurate approximate solutions for the symmetric fuzzy linear systems in (Allahviranloo et al.[1])

Integrated strategy for generating permutation

An integrated strategy for generating permutation is presented in this paper. This strategy involves exchanging two consecutive elements to generate the starter sets and then applying circular and reversing operations to list all permutations. Some theoretical works are also presented